A tabu search approach for makespan minimization in a permutation flow shop scheduling problems
نویسنده
چکیده
On a permutation flowshop scheduling problem(PFSP), n jobs are arranged on m machines in a series with the same routing for each machine. The objective of scheduling is to find a sequence of jobs under minimization of makespan. From many researches, the upperbound values from the benchmark problems have been shown. In this paper, a tabu search approach for improving the upperbound values from the previous works is investigated. The results show that the proposed procedure yields new better upperbound values for the benchmark problems.
منابع مشابه
Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملSolving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm
A frequently occurring operational problem is one of processing a given number of jobs (commodities) on a specified number of machines (facilities) referred to by various investigators as scheduling, dispatching, sequencing, or combinations thereof (Gupta and Stafford, 2006). In most manufacturing environments, a set of processes is needed to be serially performed in several stages before a job...
متن کاملManager’s Preferences Modeling Within Multi-Criteria Flowshop Scheduling Problem: A Metaheuristic Approach
This paper proposes a metaheuristic to solve the permutation flow shop scheduling problem where several criteria are to be considered, i.e., the makespan, total flowtime and total tardiness of jobs. The proposed metaheuristic is based on tabu search algorithm. The Compromise Programming model and the concept of satisfaction functions are utilized to integrate explicitly the manager’s preference...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011